Optimal scheduling of homogeneous products transportation
نویسندگان
چکیده
منابع مشابه
An Optimal Investment Scheduling Framework for Intelligent Transportation Systems Architecture
Transportation planning in general, and planning for intelligent transportation systems (ITSs) in particular, are notable for multiple goals and for multiple constituencies. A review of the current literature offers several ITS investment evaluation methods that provide frameworks for the quantification of risks and benefits. Nevertheless, the traditional selection methods overemphasize quantit...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملScheduling with Transportation
Traditionally, machine scheduling research has focused only on efficiently assigning machine-time to jobs. It has not addressed the issue of how the jobs reach the machine from their originating source or how the finished jobs are delivered to their customers. In reality, the transportation time is substantial and hence cannot be ignored. Most of these variants are N P -hard. The scheduling pro...
متن کاملHomogeneous cartesian products
A graph G is 1-homogeneous if certain isomorphisms between similarly embedded induced subgraphs of G extend to automorphisms of G. We show that the only connected composite 1-homogeneous graphs are the cube, and Kn ×K2 and Kn ×Kn with n ≥ 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Keldysh Institute Preprints
سال: 2018
ISSN: 2071-2898,2071-2901
DOI: 10.20948/prepr-2018-65